Computational burden reduction in Set-membership Hammerstein system identification

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational burden reduction in Set-membership Hammerstein system identification

Hammerstein system identification from measurements affected by bounded noise is considered in the paper. First, we show that the computation of tight parameter bounds requires the solution to nonconvex optimization problems where the number of decision variables increases with the length of the experimental data sequence. Then, in order to reduce the computational burden of the identification ...

متن کامل

Computational complexity analysis of set membership identification of Hammerstein and Wiener systems

This paper analyzes the computational complexity of set membership identification of Hammerstein and Wiener systems. Its main results show that, even in cases where a portion of the plant is known, the problems are generically NP-hard both in the number of experimental data points and in the number of inputs (Wiener) or outputs (Hammerstein) of the nonlinearity. These results provide new insigh...

متن کامل

Identification of Hammerstein Systems with Set-Valued Observations

This work is concerned with identification of Hammerstein systems whose outputs are measured by set-valued sensors. The system consists of a memoryless nonlinearity which is polynomial and possibly non-invertible, followed by a linear subsystem. The parameters of linear and nonlinear parts are unknown but have known orders. Input design, identification algorithms, and their essential properties...

متن کامل

Hammerstein system identification using nuclear norm minimization

This paper presents a new method for the identification of Hammerstein systems. The parameter estimation problem is formulated as a rank minimization problem by constraining a finite dimensional time dependency between signals. Due to the unknown intermediate signal, the rank minimization problem cannot be solved directly. Thus, the rank minimization problem is reformulated as an intermediate s...

متن کامل

System Identification Using Fractional Hammerstein Models

Abstract: Identification of continuous-time non-linear systems characterised by fractional order dynamics is studied. The Riemann-Liouville definition of fractional differentiation is used. A new identification method is proposed through the extension of Hammerstein-type models by allowing their linear part to belong to the class of fractional models. Fractional models are compact and so are us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC Proceedings Volumes

سال: 2011

ISSN: 1474-6670

DOI: 10.3182/20110828-6-it-1002.02090